首页> 外文OA文献 >Techniques for scheduling time-triggered resource-constrained embedded systems
【2h】

Techniques for scheduling time-triggered resource-constrained embedded systems

机译:调度时间触发的资源受限的嵌入式系统的技术

摘要

It is often argued that time-triggered (TT) architectures are the most suitable basis for safety-related applications as their use tends to result in highly-predictable system behaviour. This predictability is increased when TT architectures are coupled with the use of co-operative (or "non pre-emptive") task sets. \udDespite many attractive properties, such "time-triggered co-operative" (TTC) and related "time-triggered hybrid" (TTH) architectures rarely receive much attention in the research literature. One important reason for this is that these designs are seen to be "fragile": that is, small changes to the task set may require revisions to the whole schedule. Such revisions are seen as challenging and time consuming. To tackle this problem two novel algorithms (TTSA1 and TTSA2), which help to automate the process of scheduler selection and configuration, are introduced. While searching for a workable schedule, both the algorithms try to ensure that all task constraints are met, a co-operative scheduler is used whenever possible and the power consumption is kept as low as possible. The effectiveness of these algorithms is tested by means of empirical trials. \udBoth TTSA1 and TTSA2, like most of scheduling algorithms introduced in the literature, rely on knowledge of task worst-case execution time (WCET). Unfortunately, determining the WCET of tasks is rarely straightforward. Even in situations where accurate WCET estimates are available at design time, variations in task execution time, between its best-case execution time (BCET) and its WCET, may still affect the system predictability and/or violate task constraints. In an effort to address this problem, a set of code-balancing techniques is introduced. Using an empirical study it is demonstrated that these techniques help in reducing the variations in task execution time, and hence increase the system predictability. These goals are achieved with a reduced power-consumption overhead, compared to alternative solutions.
机译:人们通常认为,时间触发(TT)架构是与安全相关的应用程序的最合适基础,因为它们的使用往往会导致高度可预测的系统行为。当TT体系结构与协作(或“非抢先”)任务集结合使用时,这种可预测性会提高。 \ ud尽管具有许多吸引人的特性,例如“时间触发的协作”(TTC)和相关的“时间触发的混合”(TTH)体系结构在研究文献中很少受到关注。造成这种情况的一个重要原因是这些设计被视为“脆弱”的:也就是说,对任务集进行小的更改可能需要对整个计划进行修订。此类修订被视为具有挑战性和耗时的。为了解决这个问题,介绍了两种新颖的算法(TTSA1和TTSA2),它们有助于使调度程序选择和配置过程自动化。在寻找可行的时间表时,两种算法都试图确保满足所有任务约束,并在可能的情况下使用合作的调度器,并且将功耗保持在尽可能低的水平。这些算法的有效性通过经验试验进行了测试。就像文献中介绍的大多数调度算法一样,TTSA1和TTSA2都依赖于任务最坏情况执行时间(WCET)的知识。不幸的是,确定任务的WCET很少是一件容易的事。即使在设计时可以得到准确的WCET估计值的情况下,最佳执行时间(BCET)和WCET之间的任务执行时间变化仍可能影响系统的可预测性和/或违反任务约束。为了解决这个问题,引入了一组代码平衡技术。通过经验研究证明,这些技术有助于减少任务执行时间的变化,从而提高系统的可预测性。与替代解决方案相比,这些目标可通过减少功耗开销实现。

著录项

  • 作者

    Gendy, Ayman Khalifa Ghaly;

  • 作者单位
  • 年度 2009
  • 总页数
  • 原文格式 PDF
  • 正文语种 {"code":"en","name":"English","id":9}
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号